Managing Simple Re-entrant Ow Lines Ii. Experimental Study
نویسندگان
چکیده
This paper continues our study on the management of multi-product, capacitated re-entrant lines. Based on the theoretical framework developed in 2], we discuss some insights obtained by a simulation study. We are interested in understanding the performance of implementable capacity management schemes (No-sharing, Partial Sharing and Total Sharing) and production rules (Linear Scaling, Equalize Shortfall, Priority) in terms of inventory levels, service and cost.
منابع مشابه
Managing Simple Re-entrant Ow Lines I. Theoretical Foundation
We address several aspects related to managing re-entrant lines in an uniied manner { capacity allocation, inventory management and production control { in a set of three papers. Our approach to study these systems is through simulation based optimization. Simulation ooers the exibility to model the complexities adequately while the gradient computation (via Innnitesimal Perturbation Analysis) ...
متن کاملManaging Simple Re-entrant Ow Lines Theoretical Foundation and Experimental Results
We address several aspects related to managing re-entrant lines in a uni ed manner { capacity allocation, inventory management and production control. Our approach to study these systems is through simulation based optimization. Simulation o ers the exibility to model the complexities adequately while the gradient computation (via In nitesimal Perturbation Analysis) helps identify good solution...
متن کاملA Scheduling Model for the Re-entrant Manufacturing System and Its Optimization by NSGA-II
In this study, a two-objective mixed-integer linear programming model (MILP) for multi-product re-entrant flow shop scheduling problem has been designed. As a result, two objectives are considered. One of them is maximization of the production rate and the other is the minimization of processing time. The system has m stations and can process several products in a moment. The re-entrant flow sho...
متن کاملSolving Re-entrant No-wait Flexible Flowshop Scheduling Problem; Using the Bottleneck-based Heuristic and Genetic Algorithm
In this paper, we study the re-entrant no-wait flexible flowshop scheduling problem with makespan minimization objective and then consider two parallel machines for each stage. The main characteristic of a re-entrant environment is that at least one job is likely to visit certain stages more than once during the process. The no-wait property describes a situation in which every job has its own ...
متن کاملA simple proof of diffusion approximations for LBFS re-entrant lines
For a re-entrant line operating under the last-buffer–first-serve service policy, there have been two independent proofs of a heavy traffic limit theorem. The key to these proofs is to prove the uniform convergence of a critical fluid model. We give a new proof for the uniform convergence of the fluid model.
متن کامل